منابع مشابه
Clustered Planarity with Pipes
We study the version of the C-PLANARITY problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the STRIP PLANARITY problem. We give algorithms to decide several families of instances for the two variants in which the order of the pipes around each cluster is given as part of the input or can be chosen by the algorithm.
متن کاملOrdered Level Planarity and Geodesic Planarity
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We show NP-completeness even for the spe...
متن کاملOrdered Level Planarity, Geodesic Planarity and Bi-Monotonicity
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with...
متن کاملToward a Theory of Planarity: Hanani-Tutte and Planarity Variants
We study Hanani-Tutte style theorems for various notions of planarity, including partially embedded planarity and simultaneous planarity. This approach brings together the combinatorial, computational and algebraic aspects of planarity notions and may serve as a uniform foundation for planarity, as suggested earlier in the writings of Tutte and Wu. Submitted: November 2012 Reviewed: March 2013 ...
متن کاملNodeTrix Planarity Testing with Small Clusters
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant k. We consider both the case when the sides of the matrices to which the edges are incident are fixed and the case when they can be arbitrarily chosen. We show that NodeTrix planarity testing with fixed sides can be solved in O(k 3 2 n) time for every flat clu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACS Medicinal Chemistry Letters
سال: 2016
ISSN: 1948-5875,1948-5875
DOI: 10.1021/acsmedchemlett.6b00099